A nondeterministic space-time tradeoff for linear codes
نویسنده
چکیده
We consider nondeterministic D-way branching programs computing functions f : D → {0, 1} in time at most kn. In the boolean case, where D = {0, 1}, no exponential lower bounds are known even for k = 2. Ajtai has proved such lower bounds for explicit functions over domains D of size at least n, and Beame, Saks and Thathachar for explicit functions over domains of size at least 2 k . In this note we prove such a lower bound for an explicit function f : D → {0, 1} over substantially smaller domain of size about 2. Our function f(Y, x) has n +n variables, the first n of which are arranged in an n×n matrix Y . The variables take their values in the domain D = GF (q) for a prime power q about 2, and f(Y, x) = 1 iff the vector x is orthogonal over GF (q) to all rows of Y .
منابع مشابه
Characterization of $2times 2$ full diversity space-time codes and inequivalent full rank spaces
In wireless communication systems, space-time codes are applied to encode data when multiple antennas are used in the receiver and transmitter. The concept of diversity is very crucial in designing space-time codes. In this paper, using the equivalent definition of full diversity space-time codes, we first characterize all real and complex $2times 2$ rate one linear dispersion space-...
متن کاملLinear Scalable Space-time Codes: Tradeoff between Spatial Multiplexing and Transmit Diversity
Using a class of recently proposed linear scalable space-time codes we demonstrate the tradeoff between spatial multiplexing and transmit diversity for Rayleigh and Ricean flat fading. The codes are able to use jointly transmit diversity in combination with spatial multiplexing, and they achieve spatial and temporal diversity in Rayleigh and Rice fading environments. Frequency diversity of freq...
متن کاملTime-Space Tradeoffs for Undirected Graph Traversal by Graph Automata
We investigate time-space tradeoffs for traversing undirected graphs, using a variety of structured models that are all variants of Cook and Rackoff's ``Jumping Automata for Graphs.'' Our strongest tradeoff is a quadratic lower bound on the product of time and space for graph traversal. For example, achieving linear time requires linear space, implying that depth-first search is optimal. Since ...
متن کاملOn the Role of MMSE in Lattice Decoding: Achieving the Optimal Diversity-vs-Multiplexing Tradeoff
In this paper, we introduce the class of lattice space-time codes as a generalization of linear dispersion (LD) coding. We characterize the diversity-vs-multiplexing tradeoff achieved by random lattice coding with lattice decoding. This characterization establishes the optimality of lattice vertical codes when coupled with lattice decoding. We then generalize Erez and Zamir mod-Λ construction t...
متن کاملA Quadratic Time-Space Tradeoff for Unrestricted Deterministic Decision Branching Programs
The branching program is a fundamental model of nonuniform computation, which conveniently captures both time and space restrictions. In this paper we prove a quadratic expected time-space tradeoff of the form TS = Ω ( n2 q ) for q-way deterministic decision branching programs, where q > 2. Here T is the expected computation time and S is the expected space, when all inputs are equally likely. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 109 شماره
صفحات -
تاریخ انتشار 2009